Overlap of Convex Polytopes under Rigid Motion
نویسندگان
چکیده
We present an algorithm to compute an approximate overlap of two convex polytopes P1 and P2 in R3 under rigid motion. Given any ε ∈ (0, 1/2], our algorithm runs in O(ε−3n log3.5 n) time with probability 1− n−O(1) and returns a (1− ε)-approximate maximum overlap, provided that the maximum overlap is at least λ ·max{|P1|, |P2|} for some given constant λ ∈ (0, 1]. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
Even Valuations on Convex Bodies
The notion of even valuation is introduced as a natural generalization of volume on compact convex subsets of Euclidean space. A recent characterization theorem for volume leads in turn to a connection between even valuations on compact convex sets and continuous functions on Grassmannians. This connection can be described in part using generating distributions for symmetric compact convex sets...
متن کاملMaximum Overlap of Convex Polytopes under Translation
We study the problem of maximizing the overlap of two convex polytopes under translation in R for some constant d ≥ 3. Let n be the number of bounding hyperplanes of the polytopes. We present an algorithm that, for any ε > 0, finds an overlap at least the optimum minus ε and reports the translation realizing it. The running time is O(n d/2 +1 log n) with probability at least 1 − n−O(1), which c...
متن کاملShape matching under rigid motion
We present improved algorithms to match two polygonal shapes P and Q to approximate their maximum overlap. Let n be their total number of vertices. Our first algorithm finds a translation that approximately maximizes the overlap area of P and Q under translation in Õ(n2ε−3) time. The error is additive and it is at most ε · min{area(P ), area(Q)} with probability 1 − n−O(1). We also obtain an al...
متن کاملA Rigidity Criterion for Non-Convex Polyhedra
Let P be a (non necessarily convex) embedded polyhedron in R, with its vertices on an ellipsoid. Suppose that the interior of P can be decomposed into convex polytopes without adding any vertex. Then P is infinitesimally rigid. More generally, let P be a polyhedron bounding a domain which is the union of polytopes C1, · · · , Cn with disjoint interiors, whose vertices are the vertices of P . Su...
متن کاملFast Collision Detection between Geometric Models
We present an efficient algorithm for collision detection and contact determination between geometric models described by linear or curved boundaries and undergoing rigid motion. The set of models include surfaces described by rational spline patches or piecewise algebraic functions. In contrast to previous approaches, wefirst present a roughly constant time algorithm for collision detection be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 47 شماره
صفحات -
تاریخ انتشار 2012